Lecture 4 - Computational Indistinguishability, Pseudorandom Generators
نویسنده
چکیده
Definition 1. Let {Xn}, {Yn} be sequences of distributions withXn, Yn ranging over {0, 1}`(n) for some `(n) = nO(1). {Xn} and {Yn} are computationally indistinguishable (notation: Xn ≈ Yn) if for every polynomial-time A and polynomially-bounded , and sufficiently large n ∣∣Pr[A(Xn) = 1]− Pr[A(Yn) = 1]∣∣ ≤ (n) (If we want to nitpick, we’d give 1n as additional input to A to ensure it can run in poly(n)time even if `(n) is much smaller than n.)
منابع مشابه
COS598D Lecture 3 Pseudorandom generators from one-way functions
In this lecture we prove the existence of pseudorandom-generators assuming that one-way functions exist (Hastad, Impagliazzo, Levin and Luby '99). Our proof is with respect to non-uniform security. We also sketch the uniform case which requires a uniform version of Impagliazzo's hardcore set lemma that uses ideas from learning theory. We briefly recall some standard notions from cryptography. F...
متن کاملA NOTE ON COMPUTATIONAL INDISTINGUISHABILITY 1 Oded
| We show that following two conditions are equivalent: 1) The existence of pseudorandom generators. 2) The existence of a pair of eeciently constructible distributions which are computationally indistinguishable but statistically very diierent.
متن کاملA Note on Computational Indistinguishability
-We show that following two conditions are equivalent: 1) The existence of pseudorandom generators. 2) The existence of a pair of efficiently constructible distributions which are computationally indistinguish able but statisticaUy very different.
متن کاملComputational Indistinguishability Amplification: Tight Product Theorems for System Composition
Computational indistinguishability amplification is the problem of strengthening cryptographic primitives whose security is defined by bounding the distinguishing advantage of an efficient distinguisher. Examples include pseudorandom generators (PRGs), pseudorandom functions (PRFs), and pseudorandom permutations (PRPs). The literature on computational indistinguishability amplification consists...
متن کاملTexts in Computational Complexity: Pseudorandom Generators
A fresh view at the question of randomness has been taken in the theory of computing: It has been postulated that a distribution is pseudorandom if it cannot be told apart from the uniform distribution by any eecient procedure. The paradigm, originally associating eecient procedures with polynomial-time algorithms, has been applied also with respect to a variety of limited classes of such disti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005